Catalan and Schröder permutations sortable by two restricted stacks
نویسندگان
چکیده
Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist two restricted stacks series, ruled right-greedy procedure avoid some specified patterns. Some obtained results have been further generalized to Cayley permutations Cerbai, specialized patterns Defant Zheng, or considered context functions over symmetric group Berlow. In this work we study pattern where first stack avoids pair length 3 investigate those pairs for which sortable are counted (binomial transform the) Catalan numbers Schröder numbers.
منابع مشابه
Permutations sortable by two stacks in series
We address the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain nineteen further coefficients approximately. Analysing these coefficients by a variety of methods we conclude that the OGF behaves as S(z) ∼ A(1− μ · z) , where μ = 12.45± 0....
متن کاملPermutations sortable by deques and by two stacks in parallel
In his seminal work The Art of Computer Programming [2], Knuth was the first to consider a number of classic data structures from the point of view of the permutations they could produce from the identity permutation, or equinumerously, the permutations which the data structure can sort. Famously, he noticed that the permutations obtainable using a single stack are exactly those which avoid the...
متن کاملThe enumeration of permutations sortable by pop stacks in parallel
A stack is a last-in first-out sorting device with push and pop operations. Knuth [7] showed that a permutation π can be sorted (meaning that by applying push and pop operations to the sequence of entries π(1), . . . , π(n) we can output the sequence 1, . . . , n) if and only if π avoids the permutation 231, i.e., if and only if there do not exist three indices 1 ≤ i1 < i2 < i3 ≤ n such that π(...
متن کاملPermutations sortable by two stacks in parallel and quarter plane walks
At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutations that can be sorted using a stack. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently, Pratt and Tarjan asked about permutations that can be sorted using two stacks in parallel. This question is significantly harder, and the associated counting...
متن کاملRestricted signed permutations counted by the Schröder numbers
Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displayi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2021
ISSN: ['1872-6119', '0020-0190']
DOI: https://doi.org/10.1016/j.ipl.2021.106138